Time complexity

Results: 894



#Item
501Complexity classes / Operations research / NP / Facility location / Branch and bound / Time complexity / Theoretical computer science / Computational complexity theory / Applied mathematics

A Branch and Bound Method for Min-dist Location Selection Queries Jianzhong Qi1 Zhenghua Xu2 Yuan Xue3

Add to Reading List

Source URL: people.eng.unimelb.edu.au

Language: English - Date: 2011-11-07 02:44:04
502Concurrency control / Applied mathematics / Garbage collection / Linearizability / Algorithm / Mutator method / Reference counting / Lock / Time complexity / Computing / Theoretical computer science / Memory management

CGCExplorer: A Semi-Automated Search Procedure for Provably Correct Concurrent Collectors Martin T. Vechev Cambridge University Eran Yahav

Add to Reading List

Source URL: www.srl.inf.ethz.ch

Language: English - Date: 2011-10-04 10:24:18
503Cryptographic protocols / File sharing networks / Secure multi-party computation / Peer-to-peer / Communications protocol / Information theory / Scalability / Time complexity / Internet privacy / Theoretical computer science / Information / Data

SEPIA: Privacy-Preserving Aggregation of Multi-Domain Network Events and Statistics Martin Burkhart, Mario Strasser, Dilip Many, Xenofontas Dimitropoulos ETH Zurich, Switzerland {burkhart, strasser, dmany, fontas}@tik.ee

Add to Reading List

Source URL: sepia.ee.ethz.ch

Language: English - Date: 2011-01-06 04:06:22
504Applied mathematics / Cache / Sorting algorithms / Cache-oblivious algorithm / Computational complexity theory / Merge sort / Algorithm / Parallel computing / Time complexity / Theoretical computer science / Mathematics / Analysis of algorithms

Resource Oblivious Sorting on Multicores Richard Cole 1 2

Add to Reading List

Source URL: cs.nyu.edu

Language: English - Date: 2013-01-31 17:56:52
505NP-complete problems / Approximation algorithm / Submodular set function / Shortest path problem / Bin packing problem / Vertex cover / Dominating set / Independent set / Computational complexity theory / Theoretical computer science / Graph theory / Mathematics

SODA14 – Accepted Papers Andreas Björklund, Petteri Kaski and Łukasz Kowalik Counting thin subgraphs via packings faster than meet-in-the-middle time Anand Louis and Konstantin Makarychev Approximation Algorithm for

Add to Reading List

Source URL: siam.org

Language: English - Date: 2013-09-19 09:13:08
506Computational complexity theory / Operations research / Algorithms / Models of computation / Decision tree model / Sorting algorithm / Linear programming / Divide and conquer algorithm / Time complexity / Theoretical computer science / Applied mathematics / Mathematics

§1. Algorithmics Lecture I Page 1

Add to Reading List

Source URL: cs.nyu.edu

Language: English - Date: 2013-04-13 15:02:34
507World Wide Web / Real-time web / Social media / Text messaging / Twitter / NP / Determiner / Noun phrase / Technology / Syntactic categories / Linguistics / Complexity classes

Community-Based Classification of Noun Phrases in Twitter Freddy Chong Tat Chua ∗

Add to Reading List

Source URL: www.cs.cmu.edu

Language: English - Date: 2012-08-07 11:32:45
508Analysis of algorithms / Symmetry / Probabilistic complexity theory / Algorithm / Approximation algorithm / Anytime algorithm / Time complexity / Randomized algorithm / Theoretical computer science / Applied mathematics / Computational complexity theory

ANYTIME ALGORITHMS FOR ROBDD SYMMETRY DETECTION AND APPROXIMATION a thesis submitted to The University of Kent at Canterbury in the subject of computer science

Add to Reading List

Source URL: www.digit-labs.org

Language: English - Date: 2008-09-04 12:58:00
509Analysis of algorithms / Algorithm / Mathematical logic / Greedy algorithm / Cooperative game / Time complexity / Theoretical computer science / Mathematics / Applied mathematics

Overlapping Coalition Formation for Efficient Data Fusion in Multi-Sensor Networks

Add to Reading List

Source URL: aaai.org

Language: English - Date: 2006-06-28 16:29:26
510Analysis of algorithms / Computational complexity theory / Smoothed analysis / Linear programming / Simplex algorithm / Algorithm / Normal distribution / Simplex / Best /  worst and average case / Theoretical computer science / Applied mathematics / Mathematics

Smoothed Analysis of Algorithms: Why the Simplex Algorithm Usually Takes Polynomial Time ∗ arXiv:cs/0111050v7 [cs.DS] 9 Oct[removed]Daniel A. Spielman †

Add to Reading List

Source URL: arxiv.org

Language: English - Date: 2008-02-01 13:52:50
UPDATE